Faster than U PPAAL ? ( Tool Paper )
نویسندگان
چکیده
It is probably very hard to develop a new model checker that is faster than UPPAAL for verifying (correct) timed automata. In fact, our tool MCTA does not even try to compete with UPPAAL in this (i. e., UPPAAL’s) arena. Instead, MCTA is geared towards analyzing incorrect specifications of timed automata. It returns (shorter) error traces faster.
منابع مشابه
logcf: An Efficient Tool for Real Root Isolation
This paper revisits an algorithm for isolating real roots of univariate polynomials based on continued fractions. It follows the work of Vincent, Uspensky, Collins and Akritas, Johnson and Krandick. We use some tricks, especially a new algorithm for computing an upper bound of positive roots. In this way, the algorithm of isolating real roots is improved. The complexity of our method for comput...
متن کاملLongitudinal momentum of projectile-like residues: a new tool to investigate the EOS
A systematic investigation of the longitudinal-velocity distribution of projectile-like residues produced in the reactions U (1 A GeV) + Ti and U (1 A GeV) + Pb has been performed with the high-resolution magnetic spectrometer FRS at GSI. With increasing mass loss, the velocities first decrease, then level off, and finally increase again. Light fragments are even faster on the average than the ...
متن کاملFast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it suffers from the expensive computational cost which is at least O(n) or O(m) for graphs with n nodes and m edges. In this paper, we propose Ark, a set of fast algorithms for random walk graph kernel computation. Ark is...
متن کاملReducing Directed Max Flow to Undirected Max Flow and Bipartite Matching
In this paper, we prove two new results related to finding maximum flows in directed graphs and finding maximum matchings in bipartite graphs. In our first result, we derive a new algorithm for finding maximum flows in directed graphs. Our algorithm works by reducing a maximum flow problem on a directed graph to a maximum flow problem on an undirected graph, and running the Karger-Levine algori...
متن کاملRadiometric studies of Mycobacterium lepraemurium.
The radiometric method has been applied for studying the metabolism of M. lepraemurium and the conditions which might force or inhibit its metabolic activity in vitro. These organisms assimilate and oxidize (U-14C) glycerol, and (U-14C) acetate, but are unable to oxidize (U-14C) glucose, (U-14C) pyruvate, (U-14C) glycine and 14C-formate. When incubated at 30 degrees C M. lepraemurium oxidizes (...
متن کامل